Two examples to break through classical theorems on Nash implementation with two agents

] proposed a classical algorithm to break through Maskin's theorem for the case of many agents. In this paper, we will give two examples to break through the aforementioned results on two-agent Nash implementation by virtue of Wu's algorithm. There are two main contributions of this paper: 1) A two-player social choice rule (SCR) that satisfies Condition µ2 cannot be Nash implemented if an additional Condition λ is satisfied. 2) A non-dictatorial two-player weakly pareto-optimal SCR is Nash implementable if Condition λ is satisfied. Although the former is negative for the economic society, the latter is just positive. Put in other words, some SCRs which are traditionally viewed as not be Nash implementable may be Nash implemented now.